Partially monadic functors
نویسندگان
چکیده
منابع مشابه
Monadic Fold, Monadic Build, Monadic Short Cut Fusion
Short cut fusion improves the efficiency of modularly constructed programs by eliminating intermediate data structures produced by one program component and immediately consumed by another. We define a combinator which expresses uniform production of data structures in monadic contexts, and is the natural counterpart to the well-known monadic fold which consumes them. Like the monadic fold, our...
متن کاملOn Monadic NP vs. Monadic co-NP
It is a well-known result of Fagin that the complexity class NP coincides with the class of problems expressible in existential second-order logic (1 ;). Monadic NP is the class of problems expressible in monadic Z;, i.e., 1: with the restriction that the second-order quantifiers range only over sets (as opposed to ranging over, say, binary relations). We prove that connectivity of finite graph...
متن کاملPartially Ordered Monads for Monadic Topologies, Rough Sets and Kleene Algebras
In this paper we will show that partially ordered monads contain sufficient structure for modelling monadic topologies, rough sets and Kleene algebras. Convergence represented by extension structures over partially ordered monads includes notions of regularity and compactness. A compactification theory can be developed. Rough sets [23] are modelled in a generalized setting with set functors. Fu...
متن کاملOn Monadic Theories of Monadic Predicates
Pioneers of logic, among them J.R. Büchi, M.O. Rabin, S. Shelah, and Y. Gurevich, have shown that monadic second-order logic offers a rich landscape of interesting decidable theories. Prominent examples are the monadic theory of the successor structure S1 = (N,+1) of the natural numbers and the monadic theory of the binary tree, i.e., of the two-successor structure S2 = ({0, 1} ∗, ·0, ·1). We c...
متن کاملCopower functors
We give a common generalization of two earlier constructions in [2], that yielded coalgebraic type functors for weighted, resp. fuzzy transition systems. Transition labels for these systems were drawn from a commutative monoid M or a complete semilattice L, with the transition structure interacting with the algebraic structure on the labels. Here, we show that those earlier signature functors a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Pure and Applied Algebra
سال: 1984
ISSN: 0022-4049
DOI: 10.1016/0022-4049(84)90095-1